Models and algorithms for decomposition problems
نویسندگان
چکیده
منابع مشابه
Domain Decomposition Algorithms for Saddle Point Problems
In this paper, we introduce some domain decomposition methods for saddle point problems with or without a penalty term, such as the Stokes system and the mixed formulation of linear elasticity. We also consider more general nonsymmetric problems, such as the Oseen system, which are no longer saddle point problems but can be studied in the same abstract framework which we adopt. Several approach...
متن کاملDomain Decomposition Algorithms for Indefinite Elliptic Problems
Iterative methods for linear systems of algebraic equations arising from the finite element discretization of nonsymmetric and indefinite elliptic problems are considered. Methods previously known to work well for positive definite, symmetric problems are extended to certain nonsymmetric problems, which can also have some eigenvalues in the left half plane. We first consider an additive Schwarz...
متن کاملDomain Decomposition Algorithms for Indeenite Elliptic Problems
Iterative methods for linear systems of algebraic equations arising from the nite element discretization of nonsymmetric and indeenite elliptic problems are considered. Methods previously known to work well for positive deenite, symmetric problems are extended to certain nonsymmetric problems, which can also have some eigenvalues in the left half plane. We rst consider an additive Schwarz metho...
متن کاملModels and algorithms for network design problems
Acknowledgements First of all, I would like to warmly thank my advisors Bernard Fortz, Martine Labbé and François Louveaux for supervising my thesis. The three of you have shown me how research can be both productive and recreational. I rst came to see Martine because I was interested in the real-life applications of mathematics. Her warm welcome and sensible arguments easily convinced me to st...
متن کاملAlgorithms and Models for Problems in Networking
Many interesting theoretical problems arise from computer networks. In this thesis we will consider three of them: algorithms and data structures for problems involving distances in networks (in particular compact routing schemes, distance labels, and distance oracles), algorithms for wireless capacity and scheduling problems, and algorithms for optimizing iBGP overlays in autonomous systems on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: 4OR
سال: 2020
ISSN: 1619-4500,1614-2411
DOI: 10.1007/s10288-020-00456-9